Traffic Control in Packet Switched Networks

This thesis examines traffic control options available in two existing routing solutions in packet-switched networks. The first solution is the shortest path hop-by-hop routing deployed with the OSPF or IS-IS routing protocol and the IP forwarding protocol. This is the initially deployed and still the most popular routing solution in the Internet. The second solution is explicit routing implemented with the RSVP-TE or CR-LDP signalling protocol and the MPLS forwarding protocol. This is the latest solution to have become widely deployed in the Internet. The thesis analyses the limitations of the two routing solutions as tools for traffic control and yields new insights that can guide the analysis and design of protocols involved in the process. A set of recommendations for modifications of the existing protocols is provided which would allow for a range of new traffic control approaches to be deployed in packet-switched networks. For future routing solutions which comply with the proposed recommendations two new algorithms are presented in the thesis. They are called the Link Mask Topology (LMT) algorithm, and the Link Cost Topology (LCT) algorithm. The two algorithms define a set of routing topologies and assign network traffic to routes available in these topologies aiming to simultaneously achieve high network throughput and fair resource allocation. While there are similarities in the operation of the two algorithms, their applicability is different as they allocate resources to multiple paths between two network nodes which are available in the defined routing topologies according to a different rule set. The LMT algorithm directs traffic sent between any pair of network nodes to a single route. The LCT algorithm directs traffic sent between a pair of network nodes to a number of routes. The performance of the two proposed algorithms is evaluated in the thesis with calculations comparing them to the shortest path routing algorithm in a number of test cases. The test results demonstrate the potentials of the two proposed algorithms in improving the performance of networks which employ shortest path routing

Traffic Control in Packet Switched Networks

This thesis examines traffic control options available in two existing routing solutions in packet-switched networks. The first solution is the shortest path hop-by-hop routing deployed with the OSPF or IS-IS routing protocol and the IP forwarding protocol. This is the initially deployed and still the most popular routing solution in the Internet. The second solution is explicit routing implemented with the RSVP-TE or CR-LDP signalling protocol and the MPLS forwarding protocol. This is the latest solution to have become widely deployed in the Internet. The thesis analyses the limitations of the two routing solutions as tools for traffic control and yields new insights that can guide the analysis and design of protocols involved in the process. A set of recommendations for modifications of the existing protocols is provided which would allow for a range of new traffic control approaches to be deployed in packet-switched networks. For future routing solutions which comply with the proposed recommendations two new algorithms are presented in the thesis. They are called the Link Mask Topology (LMT) algorithm, and the Link Cost Topology (LCT) algorithm. The two algorithms define a set of routing topologies and assign network traffic to routes available in these topologies aiming to simultaneously achieve high network throughput and fair resource allocation. While there are similarities in the operation of the two algorithms, their applicability is different as they allocate resources to multiple paths between two network nodes which are available in the defined routing topologies according to a different rule set. The LMT algorithm directs traffic sent between any pair of network nodes to a single route. The LCT algorithm directs traffic sent between a pair of network nodes to a number of routes. The performance of the two proposed algorithms is evaluated in the thesis with calculations comparing them to the shortest path routing algorithm in a number of test cases. The test results demonstrate the potentials of the two proposed algorithms in improving the performance of networks which employ shortest path routing

Abstract A New Traffic Engineering Approach for IP Networks

MPLS has received considerable attention as a protocol for transporting IP packets while providing traffic engineering. It requires label distribution, which represents a significant overhead when processing connectionless traffic. This paper describes a new protocol called subIP which efficiently provides connectionless service to IP traffic while remaining the simplicity of MPLS packet forwarding. When used in conjunction with a concept called multiple topology routing, which allows multiple routes to be obtained using standard shortest path routing algorithms, it allows best effort traffic to be flexibly routed across a network domain.

Fetal middle cerebral artery pulsatility index in no-risk pregnancies: Effects of auditory stimulation and pregnancy order

© 2020 by the authors. Licensee MDPI, Basel, Switzerland. Pulsatility index (PI) values in a fetal middle cerebral artery (MCA) were compared in no-risk pregnancies to examine the differences related to auditory stimulation test and pregnancy order. The study included 196 women with no-risk pregnancies selected from the database of more than 1000 pregnant women divided into two groups. Group 1 consisted of 98 nulliparous women (C1 = 98) and Group 2 consisted of 98 parous women (C2 = 98). All pregnant women were of comparable age and fetal gestational age (GA) when MCA-PI values were recorded. Measurements of PI values in fetal MCA were obtained before and immediately after the application of fetal auditory stimulation test. The MCA-PI measuring was conducted in the period between the 36th and the 41st week of GA. The results showed that PI baseline values and PI values after defined auditory stimulation were significantly different when measured in nulliparous women compared to parous women (p = 0.001; p = 0.003, respectively), while no group differences were observed in relative PI value changes due to auditory stimulation. These findings suggest that hemodynamic changes in fetal MCA caused by defined auditory stimulation measured by PI value changes may be valuable in the assessment of fetal auditory perception functionality and its development